An iterative procedure to solve HJBI
نویسندگان
چکیده
In this paper, an iterative algorithm to solve a special class of Hamilton-JacobiBellman-Isaacs (HJBI) equations is proposed. By constructing two series of nonnegative functions, we replace the problem of solving an HJBI equation by the problem of solving a sequence of Hamilton-Jacobi-Bellman (HJB) equations whose solutions can be approximated recursively by existing methods. The local convergence of the algorithm is guaranteed. A numerical example is provided to demonstrate the accuracy of the proposed algorithm.
منابع مشابه
A modified Mann iterative scheme for a sequence of nonexpansive mappings and a monotone mapping with applications
In a real Hilbert space, an iterative scheme is considered to obtain strong convergence which is an essential tool to find a common fixed point for a countable family of nonexpansive mappings and the solution of a variational inequality problem governed by a monotone mapping. In this paper, we give a procedure which results in developing Shehu's result to solve equilibrium prob...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملDynamical Control of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear Equations
One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...
متن کاملMultigrid Methods for Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Bellman-Isaacs Equations
We propose multigrid methods for solving Hamilton-Jacobi-Bellman (HJB) and HamiltonJacobi-Bellman-Isaacs (HJBI) equations. The methods are based on the full approximation scheme. We propose a damped-relaxation method as smoother for multigrid. In contrast with policy iteration, the relaxation scheme is convergent for both HJB and HJBI equations. We show by local Fourier analysis that the damped...
متن کاملMultigrid Methods for Second Order Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Bellman-Isaacs Equations
We propose multigrid methods for solving the discrete algebraic equations arising from the discretization of the second order Hamilton–Jacobi–Bellman (HJB) and Hamilton– Jacobi–Bellman–Isaacs (HJBI) equations. We propose a damped-relaxation method as a smoother for multigrid. In contrast with the standard policy iteration, the proposed damped-relaxation scheme is convergent for both HJB and HJB...
متن کامل